A Complete Characterization of the Robust Isolated Calmness of Nuclear Norm Regularized Convex Optimization Problems
نویسندگان
چکیده
منابع مشابه
A complete characterization of the robust isolated calmness of nuclear norm regularized convex optimization problems
In this paper, we provide a complete characterization of the robust isolated calmness of the KarushKuhn-Tucker (KKT) solution mapping for convex constrained optimization problems regularized by the nuclear norm function. This study is motivated by the recent work in [8], where the authors show that under the Robinson constraint qualification at a local optimal solution, the KKT solution mapping...
متن کاملCharacterization of the Robust Isolated Calmness for a Class of Conic Programming Problems
This paper is devoted to studying the robust isolated calmness of the Karush– Kuhn–Tucker (KKT) solution mapping for a large class of interesting conic programming problems (including most commonly known ones arising from applications) at a locally optimal solution. Under the Robinson constraint qualification, we show that the KKT solution mapping is robustly isolated calm if and only if both t...
متن کاملA Simple Algorithm for Nuclear Norm Regularized Problems
Optimization problems with a nuclear norm regularization, such as e.g. low norm matrix factorizations, have seen many applications recently. We propose a new approximation algorithm building upon the recent sparse approximate SDP solver of (Hazan, 2008). The experimental efficiency of our method is demonstrated on large matrix completion problems such as the Netflix dataset. The algorithm comes...
متن کاملConditional gradient algorithms for norm-regularized smooth convex optimization
Motivated by some applications in signal processing and machine learning, we consider two convex optimization problems where, given a cone K , a norm ‖ · ‖ and a smooth convex function f , we want either (1) to minimize the norm over the intersection of the cone and a level set of f , or (2) to minimize over the cone the sum of f and a multiple of the norm. We focus on the case where (a) the di...
متن کاملRobust nuclear norm regularized regression for face recognition with occlusion
Recently, regression analysis based classification methods are popular for robust face recognition. These methods use a pixel-based error model, which assumes that errors of pixels are independent. This assumption does not hold in the case of contiguous occlusion, where the errors are spatially correlated. Furthermore, these methods ignore the whole structure of the error image. Nuclear norm as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Mathematics
سال: 2018
ISSN: 0254-9409,1991-7139
DOI: 10.4208/jcm.1709-m2017-0034